منابع مشابه
Computing the Largest Empty Rectangle
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] ...
متن کاملComputing Enclosures of Overdetermined Interval Linear Systems
This work considers special types of interval linear systems overdetermined systems, systems consisting of more equations than variables. The solution set of an interval linear system is a collection of all solutions of all instances of an interval system. By the instance, we mean a point real system that emerges when we independently choose a real number from each interval coefficient of the i...
متن کاملComputing the largest inscribed isothetic rectangle
This paper describes an algorithm to compute, in (log n) time, a rectangle that is contained in a convex n-gon, has sides parallel to the coordinate axes, and has maximum area. With a slight modiication it will compute the smallest perimeter. The algorithm uses a tentative prune-and-search approach, even though this problem does not appear to t into the functional framework of Kirkpatrick and S...
متن کاملNumerical Study on Convective Heat Transfer Enhancement in Horizontal Rectangle Enclosures Filled with Ag-Ga Nanofluid
The natural convection heat transfer of horizontal rectangle enclosures with different aspect ratios (A = 2:1 and A = 4:1) filled with Ag-Ga nanofluid (different nanoparticle volume fractions φ = 0.01, φ = 0.03, φ = 0.05 and radiuses r = 20 nm, r = 40 nm, r = 80 nm) at different Rayleigh numbers (Ra = 1 × 103 and Ra = 1 × 105) is investigated by a two-phase lattice Boltzmann model. It is found ...
متن کاملComputing slope enclosures by exploiting a unique point of inflection
Using slope enclosures may provide sharper bounds for the range of a function than using enclosures of the derivative. Hence, slope enclosures may be useful in verifying the assumptions for existence tests or in algorithms for global optimization. Previous papers by Kolev and Ratz show how to compute slope enclosures for convex and concave functions. In this paper, we generalize these formulas ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1993
ISSN: 0925-7721
DOI: 10.1016/0925-7721(93)90012-u